Storing and retrieving objects on a computer network in a distributed database

ABSTRACT

Further preferred embodiments of the present invention include methods directed to (a) Active Data Structures, (b) Mobile Devices, (c) Ad-Hoc Device Collections, and (d) Concurrent Massively Parallel Supercomputers. Therein, a distributed, object-oriented database engine utilizing independent, intelligent processing nodes as a cooperative, massively parallel system with redundancy and fault tolerance. Instead of using traditional methods of parallelism as found in most distributed databases, the invention utilizes a messaging system and a series of message processing nodes to determine where attributes and data files associated with objects are stored. The architecture is loosely coupled, each node independently determining if it manages or routes storage and retrieval requests.

CROSS REFERENCE TO RELATED APPLICATION

This application is a continuation-in-part of pending U.S. utility application Ser. No. 13/629,418 filed Sep. 27, 2012 which is a continuation-in-part of U.S. utility application Ser. No. 12/402,039, filed Mar. 11, 2009, (and now U.S. Pat. No. 8,301,634), which is a divisional of U.S. utility application Ser. No. 11/043,864, filed Jan. 26, 2005 (and now U.S. Pat. No. 7,523,130), which is based on and claims priority from U.S. provisional application 60/540,362, filed Jan. 28, 2004; U.S. provisional application 60/553,383, filed Mar. 16, 2004; U.S. provisional application 60/553,378, filed Mar. 17, 2004; and U.S. provisional application 60/553,377, filed Mar. 17, 2004.

FIELD OF THE INVENTION

The present invention relates generally to data distributed within a network and more particularly to a method and system for storing, cataloging and retrieving a set of object attributes distributed within a network.

BACKGROUND OF THE INVENTION

Recently, the ability of devices to collect large amounts of data has increased dramatically. This includes consumer devices such as electronic cameras, video recorders and cellular telephones, but also devices embedded within assemblies, and sensors used for tracking product and asset movement. Additionally, the amount of information publicly available has increased geometrically with the Internet representing the largest distributed collection of data currently available. In addition to the sheer quantity of information, much information now has temporal attributes and spatial attributes such that the value of the information is far greater when placed in context with other information. For example, the use of instant location sensing for advertising purposes on cellular telephone networks, or the ability to mark electronic photographs with the time and location of their creation.

While the data collection and retrieval capabilities of devices and the Internet has grown tremendously, the ability to perform data manipulation and retrieval operations on that data has been slow to catch up. In particular, ad-hoc queries of unstructured information are resource-intensive and require large capital investment in centralized, massively parallel database systems with specialized software. The present invention creates a means by which structured and unstructured data may be stored, retrieved and searched using a highly expandable architecture that retains high performance even as it grows to large sizes, and which provides for managing data sets using resources that may not be constantly or reliably available, or which for security reasons must be duplicated to prevent loss of data. Typical approaches for solving scalability, availability and cost issues include:

Using multiple copies of a database to allow parallel searches on separate systems and thus increase performance and reduce the potential for loss of data. This approach is used by the popular open-source database “MySQL”, wherein a master database server uses a series of read-only “slave” servers to distribute query loads. In FIG. 8, a block diagram of this arrangement is shown. SQL commands 810 are received from a client application 801, and transmitted through a network 802 to be received by a master SQL server 803. The master SQL server 803 dispatches the SQL commands 811 received to one of the slave servers 805-807, normally attempting to find the slave with the lowest overall load factor. Updates received by the master SQL server 803 are applied in parallel to all slave SQL servers 805-807.

Distributing known portions of a database across many systems, using a central index to determine the system on which the portions of the database required are located. This approach is used by many Internet search engines, most notably Google, AltaVista and FAST. FAST in particular presents a highly parallel system in which each individual server contains a series of proprietary embedded processors with private memory, each searching a small fragment of the total database. Google uses a massive number of low-cost servers, each of which also routes data packets to reduce network infrastructure loads when switching points in the network must be used. In all cases, a central metadata index is retained which directs applications requesting data to the servers containing that data. FIG. 9 is a block diagram of the functional elements in a typical Internet search engine 900. On the searching side, a web server 901 generates requests from an HTML form which are then handled by query processors 902-904. The query processors 902-904 generate search requests which are then dispatched in parallel to a series of database servers 905-910, each of which contains a subset of the total collection of documents or data being searched. Each database server 905-910 subsequently returns a small set of matching documents; all sets are then merged by the query processors 902-904 and returned to the web server 901 for presentation. On the data collection side, a web crawler 914 collects the text from web pages scattered across the Internet, forwarding these to a series of parsers 911-913, which reduce each page to a set of unique words. These unique words are then stored by the database servers 905-910 for later searches.

Distributing subsets of a database across many systems. This is done in large SQL databases such as Oracle, where a server or set of servers contains a single column or index associated with the rows in a relational database. FIG. 10 is a block diagram of the functional elements within a distributed relational database 1000. In this arrangement, an SQL interpreter and query processor 1001 is used to forward queries to an index database server 1002 which returns the row numbers for all matching rows in a table. The SQL query processor 1001 subsequently retrieves the columns for the matching tables from the database servers 1003-1006 that contain the individual columns of each table.

In addition to the difficulties represented by managing large data sets, present database engines are not typically designed to allow flexible data retrieval using unstructured source data, such as word processing documents, images, audio files, and other types of information that do not fall within the traditional model of a relational database. In an unstructured database system, objects with a series of attributes are stored, and the attributes are made searchable for later retrieval.

Internet search engines represent a special case of the unstructured search engine, where an inverted index of the content of web pages and word processing documents is created. However, each web page has more attributes associated with it than the words within the page and the frequency of occurrence of those words. There are also attributes such as the date and time of creation, the total size of the page, implied and implicit concepts in the content, abstracts, the physical and logical location of the page, and other information. In most systems, this information is not stored.

Another difficulty experienced by current unstructured databases is the lack of a temporal or physical capability; that is, current systems do not identify the physical location of a document, or the content of the document through successive revisions. For example, Google provides a searchable index of the World Wide Web as of the last indexing operation; historical content is not maintained. Even if such information were maintained by a search engine provider as Google, the methods employed by Google for data storage and retrieval would not be capable of managing the ever-expanding storage requirements.

There is a need for a scalable, robust and flexible database architecture which provides a means of storing large quantities of unstructured data.

SUMMARY OF THE INVENTION

Embodiments of the present invention use a distributed series of independent, intelligent nodes, called “agents”, within a computer network to store data and meta-data, called “attributes” associated with objects, where each attribute is identified by a unique key value, each key value having a number of distinct segments that are independently indexed. Attributes are manipulated using a series of messages passed between agents. Each agent uses a series of rules combined with other data to determine the disposition of messages received. For the purposes of the following discussion, “object” refers to any physical or electronically created entity, including events. “Attribute” refers to a facet or type of information associated with an object, typically represented as a child object. For example, a person would have a name attribute or facet with a certain value such as “John.” The facet is represented as a child object associated with the person.

According to one aspect of some embodiments of the present invention, each agent references a list or plurality of lists of remote nodes to which the node may connect via a messaging system. For the purposes of this discussion, a network of agents is defined as one or more agents.

According to a further aspect of some embodiments of the present invention, an external entity or plurality of entities may connect to any agent in the network of agents via the same messaging system via which agents communicate with each other.

According to another aspect of some embodiments of the present invention, a plurality of agents may exist within the confines of a computer system or plurality of computer systems.

According to another aspect of some embodiments of the present invention, an agent may reside within a traditional computer system or within any device capable of supporting processing and communications functions necessary for the operation of an agent.

According to another aspect of some embodiments of the present invention, each agent references a set of specifications that indicate what messages the agent may process, and a set of specifications for each remote agent indicating what messages a remote agent or a plurality of remote agents may process.

According to another aspect of some embodiments of—the present invention, messages received by an agent from a transmitting entity or plurality of entities may be processed within the agent, or forwarded to a plurality of remote agents based on the specifications for each remote agent and the resulting matches between the content of the message and the remote agents.

According to another aspect of some embodiments of the present invention, results of processing messages received by the agent are sent to the application or entity that transmitted the original message to the agent.

According to another aspect of some embodiments of the present invention, the entity transmitting messages to the agent may transmit messages as a series of independent communications, or as parts of a continuous communication.

According to another aspect of some embodiments of the present invention, agents may communicate with each other using a continuous communication system, or using each message as an independent communication event.

According to another aspect of some embodiments of the present system, agents may terminate connections with remote agents based on the content of messages received by an entity sending messages to the agents, or based on the content of messages received from remote agents, or based on the processing state of the agent or external inputs to the agent.

According to another aspect of some embodiments of the present invention, any messages generated by one remote agent or a plurality of remote agents that received a copy of the original message received by the agent from an entity or plurality of entities are forwarded to the entity or plurality of entities that transmitted the original message to the agent.

According to another aspect of some embodiments of the present invention, a message transmitted to the agent by an entity or a plurality of entities may be forwarded to an agent or plurality of agents that are designated as the recipients of all messages which the present agent and the plurality of remote agents to which the present agent may send messages are unable to process.

According to another aspect of some embodiments of the present invention, messages received or transmitted by agents and entities communicating with agents contain a message type, a unique identifier, a plurality of structured data elements, a plurality of unstructured data elements and a plurality of message path identifiers.

According to another aspect of some embodiments of the present invention, the structured data elements contained in a message consist at a minimum of a data element name and a data element content object for each structured data element.

According to another aspect of some embodiments of the present invention, the unstructured data elements contained in a message consist at a minimum of a data element length and a data element content object for each unstructured data element.

According to another aspect of some embodiments of the present invention, a message path consists of a plurality of unique agent identifiers arranged as a list such that the list of agent identifiers reflects the path of transmission through a plurality of agents.

According to another aspect of some embodiments of the present invention, the message path contained within a message is appended to upon transmission from an agent to a plurality of other agents.

According to a further aspect of some embodiments of the present invention, the method of transmission between a plurality of agents and entities communicating with a plurality of agents includes but is not limited to a store-and-forward messaging system, a direct connection between agents utilizing a data stream transmitted over an electronic network, a shared memory segment system such as is used in parallel processing systems, and a storage-based message passing system utilizing shared external storage attached to a plurality of computers.

According to another aspect of some embodiments of the present invention, messages transmitted between a plurality of agents contain a unique identifier that is further subdivided such that the identifier contains a set of segments.

According to a further aspect of some embodiments of the present invention, agents receiving or transmitting messages determine the path of transmission and processing steps based upon the content of the unique identifier segments as outlined previously, and the type of message processed.

According to another aspect of some embodiments of the present invention, when processing a received message, an agent examines the content of the unique identifier segments and the type of message to determine if the message may be processed locally based on the content of the unique identifier segments.

According to a further aspect of some embodiments of the present invention, when processing a received message, an agent examines the content of the unique identifier segments and the type of message to determine which of the plurality of remote agents that the present agent is allowed to communicate with may receive a copy of the message.

According to a further aspect of some embodiments of the present invention, messages may be generated by an agent based on the processing results of previously received messages within the agent, or messages received from an entity or remote agents which are processing messages previously received. Such messages may be transmitted to entities or remote agents based on a plurality of rules.

According to a further aspect of some embodiments of the present invention, messages not deliverable due to communications errors or restrictions are queued for later transmission.

According to a further aspect of some embodiments of the present invention, a plurality of rules may be specified to cause an agent to receive but not transmit messages, or to transmit but not receive messages, or both transmit and receive messages based on local state or configuration information, state or configuration received from a plurality of remote agents, or state or configuration received from a plurality of external or internal sources.

According to another aspect of some embodiments of the present invention, unique identifier segments may be associated with external logical or physical values such as location information or temporal information (date and time).

According to another aspect of some embodiments of the present invention, agents may report the existence of attributes stored within the agent without returning the actual content of those attributes.

According to a further aspect of some embodiments of the present invention, agents store electronically created objects including but not limited to word processing documents, audio files and images in a storage management system.

According to another aspect of some embodiments of the present invention, the file storage system contained within the agents maintains a list of all objects stored including statistical and metadata for each object and the storage media upon which the objects reside.

According to another aspect of some embodiments of the present invention, electronic objects stored within the file storage system within an agent are given unique identifiers such that attributes referencing these files may be used by remote agents or entities communicating with agents for retrieval and identification purposes.

According to another aspect of some embodiments of the present invention, attribute content and the content of electronic objects stored within agents are processed upon receipt and storage by the agent such that an inverted index is created, as will be understood by those generally proficient in the art.

According to a further aspect of some embodiments of the present invention, attributes are stored in database files within the plurality of agents, such databases including but not limited to traditional relational databases as well as proprietary or special databases.

According to a further aspect of some embodiments of the present invention, agents contain a database engine designed such that the individual segments of the unique identifiers associated with attributes are indexed to allow retrieval of the associated attributes using sparse unique identifier values, wherein a range of contiguous or non-contiguous values for a plurality of unique identifier segments are used for retrieving attributes stored within an agent.

According to another aspect of some embodiments of the present invention, unique identifiers are stored within the database engine such that each segment of the unique identifier is stored as a separate indexed record within a traditional sorted index as understood by those generally proficient in the art.

According to a further aspect of some embodiments of the present invention, each index record for unique identifier segments contains the number of the segment within the unique identifier, the content of the segment, and the record number or file position offset of the attribute data as stored within a file.

According to a further aspect of some embodiments of the present invention, six individual index files are created within the database engine such that the possible permutations of the unique identifier segment number, unique identifier segment value and record number or file position offset of the attribute data are stored within the index files.

According to another aspect of some embodiments of the present invention, each of the previously recited methods is performed by a program contained on a computer-readable medium, such as a CD-ROM.

According to another aspect of some embodiments of the present invention, index records for a given segment of the unique identifier may be stored in separate index files, such that the name of the index file or metadata associated with the index file indicates the segment number with which the index records are associated.

According to another aspect of the present invention, a secure method of data storage may be implemented by using a series of agents and local event storage objects. When a set of data is stored, it is broken into subsets according to rules or patterns associated each agent to receive the set of data. Each subset of data is then distributed to other agents, and such subsets of data may be altered algorithmically before being distributed. Each agent receiving a data subset may then alter each subset, subsequently transmitting the entire subset or portions of each subset to other agents according to a series of rules, and may also either forward or store the data subset. The transformations or alterations of the set of data or subsets of data may be influenced by algorithms, local environments in which the agents operate, or the identity of the agent to which the data is submitted and the route through agents taken to arrive at the present agent. Retrieval of the data subsets may require that the retrieval request be submitted to a specific set of agents (not necessarily the same agents to which the original data was submitted). As with data storage, each retrieving agent may alter the retrieved data according to a series of rules, and as data is sent to other agents, it may be collated and assembled. According to a further aspect of the present invention, if a request is not made via the appropriate agent or agents, the returned data may be intentionally false or unusable, or no data may be returned. The result being that improperly requested data will be useless or non-existent.

According to a further aspect of the present invention, data may be separated by agents using pattern matching such that different subsets of the data are routed to different nodes, where terminal nodes (where data is stored) may be reached via different routes through intermediate nodes that perform encryption or modifications on the data sets.

According to a further aspect of the present invention, data retrieved after being distributed across several nodes must be requested via a specific node or nodes and a specific route must be used across intermediate nodes such that if the route is not correct, the data will not be retrieved. Instead, a message indicating an error may returned, or random data which gives the appearance of a successful retrieval.

According to a further aspect of the present invention, data may be embedded during processing by a node using steganography or other methods using local, environmental or conditional data as part of the encoding. Data may be decoded only if appropriate environmental, local or conditional flags are correct.

According to another aspect of the present invention, data may only be stored successfully if other nodes in a group of nodes receive the data within a certain time, or if the data has been routed appropriately across a network. Route data may include metadata associated with network data packets and other information.

According to another aspect of the present invention, movement of event objects, either storage, search or retrieval, may trigger the algorithmic processing of event object or other data stored within or accessible to a group of agents. One or more local or remote agents would monitor and report on the progress of such processing, and also report the results of the processing as event objects which are stored and/or distributed to other agents.

DESCRIPTION OF THE DRAWINGS

FIG. 1 is a functional block diagram of a series of related agents such as would be found in a collection of servers storing associated attributes.

FIG. 2 is a functional block diagram of the components of an agent.

FIG. 3 is a functional block diagram illustrating the relationship between agents and physical computer servers.

FIG. 4 is a functional block diagram of the components in the database engine.

FIG. 5 is a diagram of the relationship between unique identifier key segments and the index files used to store the key segment data.

FIG. 6 is a bubble chart describing the message processing logic used within an agent.

FIG. 7 is a functional block diagram illustrating the relationship between a network of agents wherein each agent is responsible for messages with certain unique identifier key segment values.

FIG. 8 is a functional block diagram describing the structure of a parallel SQL database architecture utilizing multiple complete database copies.

FIG. 9 is a functional block diagram describing the typical structure of a large Internet search engine.

FIG. 10 is a function block diagram describing the structure of a parallel SQL database architecture utilizing distributed table columns.

FIG. 11 is a diagram describing the structure of an inverted index.

FIG. 12 is a diagram illustrating the relationships between clients and agents.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 2 is a functional block diagram of agent node 200 and the data flow within that agent according to one embodiment of the present invention. Agent 200 includes communications interface 202, described in more detail below, operable with computer network 201 to which and from which messages 210 are communicated. Agent 200 also includes virtual machine 203, described in more detail below, which retrieves configuration data 214 from configuration database 207, and which stores and retrieves object data and meta data 212 to and from object processor 204, which will be described in more detail later in this document. Object processor 204 stores and retrieves objects, object references, and object data 215 to and from object storage 206. Agent 200 also includes file storage manager 205, which will be described in more detail below, to which virtual machine 203 sends electronic files 213. Communications interface 202 may consist of a typical stream-based socket connection via the Internet, a local area network, a store-and-forward message system, a series of queues, shared memory or shared storage devices. Regardless of the method, virtual machine 203 periodically listens for incoming messages 211 and processes them as they arrive.

In a typical embodiment, virtual machine 203 receives a message 211 containing a unique identifier with key segments and determines if the message should be forwarded to other agent nodes. If a message is to be forwarded, the message is sent by virtual machine 203 to communications interface 202, which then transmits message 210 to network 201. If the message is to be processed locally, this is done such that object data and meta data 212 and object references 215 are stored locally via object processor 204, and electronic files 213 are sent to file storage manager 205, which subsequently stores electronic files 216 in file storage media 208.

Virtual machine 203 determines the disposition of messages 211 by comparing the values of the unique identifier key segments against the range of allowable segment values as determined by retrieving range definitions from configuration database 207. For example, a range of allowable values is defined for the first key segment, and the value of that key segment is compared against the range of allowed values retrieved from configuration database 207. If the key value is out of range, virtual machine 203 will not perform local processing of the message. The same comparison is performed for all key segment values until all key segment values have been processed. In addition to checking the key segment ranges for virtual machine 203, virtual machine 203 retrieves a list of remote agents 214 from configuration database 207. For each agent that messages may be forwarded to from the present agent, virtual machine 203 performs a range test of the message key segment values against the range values defined for each agent. Agents for which the message key segment values fall within the ranges for the agent will receive a forwarded copy of message 211.

File storage manager 205 stores and retrieves electronic files 213 for agent node 200 on storage media 208 as electronic files 216. File storage manager 205, upon receiving electronic file 213, determines where electronic file 213 may be stored based on storage heuristics and storage media definitions 218 retrieved from the list of storage areas 217 associated with storage media available to the agent node, and places the file in file storage 208 as indicated by the computations performed. Upon receiving a request to retrieve electronic file 213, file storage manager 205 retrieves electronic file 216 from file storage 208 and transmits electronic file 213 to virtual machine 203, which then transmits electronic file 213 to the communications interface 202 for transmission as message 210.

FIG. 1 is a functional block diagram of a series of related agents 100 such as would be found in a collection of servers storing associated attributes in one embodiment of the present invention. The series of agents 100 includes client entity 101, network 102, such as the Internet or a local-area network, and one or more agent nodes 103-108. Client entity 101 initiates message 110, which is transmitted to a known agent node 103. Agent node 103 examines unique identifier key segments present in message 110 and dispatches copies 112 and 113 of message 110 based on the content of the key segments. The process by which decisions are made based on the content of the key segments will be detailed later in this document. Agent node 103 may also, based on the content of the key segments, process the message locally after which point it returns message 118 to the client entity 103 via the network 102. Agent node 105, based on message 113 received from the agent node 103, performs an analysis of identifier key segments contained in message 113, determining from this analysis performed. If actions are taken based on the content of message 113, status and other messages 119 are sent to agent node 103 which then forwards these messages to client entity 101 via the network 102. Since agent node 103 originally sent messages to both agent node 104 and agent node 105, agent node 104 is processing the message 112 received from agent node 103 simultaneously with the processing being performed by agent node 105. As with agent node 105, agent node 104 performs an analysis of unique identifier key segments in message 112, forwarding copies 114, 115, and 116 to agent node 106, agent node 107, and agent node 108, respectively. As was done by agent node 105, agent node 106, agent node 107, and agent node 108 perform any appropriate local processing of messages 114, 115, and 116, respectively, sending reply messages 121,122, and 123, respectively to agent node 104. These reply messages are then forwarded by agent node 104 to agent node 103 by messages 120. Agent node 103 then forwards these messages to client entity 101 via network 102. In this embodiment of the present invention, not all agents necessarily receive a copy of a message, such as message 110. If the unique identifier key segments indicate that an agent should not receive a message, that agent will not participate in the processing of the message, nor will that agent therefore transmit a copy of the message to any agent(s) to which it is connected. In another aspect of this embodiment, agent node 108 may determine that message 116 must be sent to another set of agents (represented by block 190) via the network connection 191. In this aspect, message 140 is sent to another set of agents as a forwarded copy of message 116. Replies from the other set of remote agents processing message 118 are returned via messages 124. Messages 124 are then forwarded, if appropriate, by agent node 108 via messages 123 to database node 104. Database node 104 then forwards the message received via message path 123 to database node 103 via message path 120. Database node 103 then sends the message to the client entity 101 via message pathway 118. In a further aspect of this embodiment, objects, object catalogs and meta-data stored in repositories 127, 128, 129, 130 and 131 are manipulated by their respective individual agent nodes 103, 105, 106, 107 and 108.

FIG. 3 is a block diagram depicting the physical relationship between computer hardware and agent nodes in one embodiment of the present invention. In this diagram, it is shown that client entity 301 may communicate with agent node 312, agent node 305, agent node 306, and agent node 307 as separate agent nodes via messages 308-313 and network 300, though agent node 305, agent node 306, and agent node 307 are all depicted as computer programs being executed by a single database server computer or virtual machine 350. Additionally, messages 309 from agent node 305 may be sent to agent node 312, agent node 306, and agent node 307. Additionally, the communications interface 302, communications interface 303, and communications interface 304 may represent different types of communication methods and capabilities.

FIG. 4 is a block diagram detailing the components of object processor 204 found in FIG. 2 of this document as shown in one embodiment of the present invention. Object processor 450 consists of a communications interface 401 (which may represent an applications program interface or API), object storage manager 402 which stores and retrieves variable or fixed-length data records using one or more method(s) (an SQL server or flat-file record handler are two examples), an indexed key segment manager 404 which stores the unique identifier key segments as defined previously for messages and for which the database file layout will be detailed later in this document, and an inverted symbol index 403 which is familiar to those generally practiced in the art. The communications interface 401 performs all coordination between the object storage manager 402, the inverted symbol index 403 and the index key segment processor 404. When messages 420 containing object data and meta data are received by communications interface 401, they are forwarded as messages 421 to virtual machine 406, which then determines the key segment values using instructions and configuration data 428 as stored in the configuration and machine instruction repository 408. The key segment values are then assembled as unique identifiers which are then sent to the indexed key segment processor 404 by message pathway 422 for storage based on the configuration data and machine instructions 423 retrieved from the configuration database 408. Object data and object meta data 427 enclosed in received messages 420 are stored on media 407 accessible to the agent node via the storage manager 402 based on machine instructions 424, and the content of the object data and object meta data are parsed for content by the object storage manager 402 to create symbol and index data 426 for storage of inverted symbol index 403. Upon receiving a retrieval request message 420, which is forwarded as message 421 to virtual machine 406, virtual machine 406 first identifies all matching object data and object meta data 427 using the indexed key segment manager 404 and the inverted index 403. Once matching object data and object meta data have been found, object data and object meta data are retrieved from object storage manager 402, and a message containing the object data and object meta data is sent to the communications interface 401 through virtual machine 406.

FIG. 5 is a block diagram of the relationships between object data messages, unique identifier key segment values, and the key segment value indexes according to an embodiment of the present invention. The object data record 501 consists of a unique pointer 502 to the location of object data 507 as stored within a traditional relational database, flat-file record handler or other record storage system. Object data record 501 further contains record status indicator 503, which may be used to indicate whether the object data is available, deleted, or has some other special status. The object data record 501 also contains a key length 514, indicating the total size of the unique identifier including all segment values which may or may not be included in the body of the unique identifier. Additionally, the object data record 501 contains a number of key segments 504-506, a data size indicator 515, and an object data area 507. Each key segment 504-506 contains an implied or explicit segment number 511-513, respectively. Each index 508-510 contains at least three index elements per entry: The key segment value 504, the key segment number 511 and the object data pointer 502. Index A 508, Index B 509, and Index C 510 differ in that each represents a permutation of the three key element types. For the sake of brevity, only three indices are shown in FIG. 5. All indices 508-510 are maintained in sorted order such that the first element of each key record represents the most significant sort information, the second the next most significant and so on, and such that the last element represents the least-significant sort information.

According to one embodiment of the present invention, an exact match for a given object data block 507 may be found by performing successive retrievals based on the structure of Index B 509. In this method, the search algorithm begins with the set of key records in which key segment value one 504 and the segment number 511 match the desired key segment value and segment number. For each of these matching records, a match where key segment two 505 and key segment number 512 also match the desired value for key segment two, but also where pointer 502 is the same between both records. In the present embodiment, Index C 510 would provide the ability to search for the remaining segment values in <n> requests, where <n> is the total number of key segments. If all searches for all key segments are successful, the object data 507 is found.

In another embodiment of the present invention, a predetermined key segment would contain a unique identifying value for an object data record, and only one search would be required to identify the pointer value 502 necessary to retrieve the data associated with object data 507.

In another embodiment of the present invention, a series of object data values 507 whose key segment values 504-506 match a series of ranges may be found. In this embodiment, Index A 508 is searched for all key values in a segment where the key values occur within a certain range. Matching object data values 507 will be those where further matches performed in Index C 510 match, where a search is performed for the same pointer 502 value found in Index A 508 where the subsequent segment number 511-513 as specified in the search specification is the same, and the segment value 505-506 is within the range given in the search specification.

FIG. 6 is a bubble chart detailing the logic used in processing messages received by the communications processor 600 associated with a given agent node. In one embodiment of the present invention, a message is received from a client entity 601. The content of the unique identifier key values obtained from object data and object meta data stored in the message is applied in comparison to a list of remote agent nodes for which key segment value ranges are known 602. If any remote agents are found to be eligible to receive the message, the message is forwarded to these agents 603. In the subsequent step, the message key segments are examined to see if the message is to be processed locally 604. If so, the message is processed locally 605 and the results of that processing are sent to the client entity 501. The logic now enters a loop, the steps of which consists of checking for new messages from the client entity 601, forwarding them if appropriate to the selected remote agents, and checking for messages from the remote agents and forwarding them to the client entity 601. In the first step of the loop, a check is made for new messages 606 from the client entity 601. If new messages are present, these are forwarded to the remote agents previously determined 507, and then are checked for local processing 608. In the next step of the loop, a check is made to determine if any of the remote systems to which messages were sent have sent messages 609. If messages have been received, these are forwarded 610 to the client entity. In the next step 611, any remotes that have indicated they are finished with processing are disconnected. In the next step, a check is made to see if all remotes have finished processing 612. If so, the client entity 601 is notified that processing is complete 613. Otherwise, the loop continues with checking for messages 606 from the client entity.

FIG. 7 is a functional block diagram illustrating an embodiment of the present invention as a series of relationships between a network of agents wherein each agent is responsible for messages with certain unique identifier key segment values. In the embodiment depicted, there are three sets of agent nodes, each processing a successively narrower range of key values, and there is only one key segment defined. In the embodiment shown, the top level agent 701 is shown as handling no key ranges, but that child agent A 702 is able to process key segment values between zero and “M”, while child agent B is able to process key segment values between “N” and “Z”. As would be expected using the previously described methods for determining message routing, the result of this arrangement is that the top level agent 701 will never process messages locally, but will instead forward all messages to either child A 702 or child B 703. Proceeding, child A 702 is able to process all messages with key segment values of zero. For all others, child A-1 704 is shown as able to process messages with key segment values of “1” to “9” and child A-2 705 is shown as able to process messages with key segment values of “A” to “F”, and finally child A-3 706 is shown as able to process messages with key segment values of “G” to “M”. Proceeding to the next level of detail, it is shown that child A-1 704 can process messages with key segment values between “1” and “9”. For the sake of brevity, further discourse on the message ranges will be withheld. However, this same methodology is used for the remaining agent nodes. In another embodiment of the present invention, agent nodes may have identical key segment range settings, permitting automatic duplication and parallelization of stored attribute data.

FIG. 8 is an embodiment of prior art consisting of a block diagram of a distributed database organized as a set of replicated databases on slave servers 805807 attached to a master server 803. SQL commands 810 are received from a client application 801, and transmitted through a network 802 to be received by a master SQL server 803. The master SQL server 803 dispatches the SQL commands 811 received to one of the slave servers 805-807, normally attempting to find the slave with the lowest overall load factor. Updates received by the master SQL server 803 are applied in parallel to all slave SQL servers 805-807. In another embodiment of this prior art, remote applications connect directly to the slave servers 805-807 for all retrieval operations, and connect to the master server 803 for all update and storage operations.

FIG. 9 represents prior art and consists of a block diagram of the functional elements in a typical Internet search engine 900. In the typical embodiment of the prior art, a web server 901 generates requests from an HTML form displayed at the workstation for a user which are then handled by query processors 902-904. The query processors 902-904 generate search requests which are then dispatched in parallel to a series of database servers 905-910, each of which contains a subset of the total collection of documents or data being searched. Each database server 905-910 subsequently returns a small set of matching documents; all sets are then merged by the query processors 902-904 and returned to the web server 901 for presentation. To collect data later used for searches, a web crawler 914 collects the text from web pages scattered across the Internet, forwarding these to a series of parsers 911-913, which reduce each page to a set of unique words. These unique words are then stored by the database servers 905-910 for later searches.

FIG. 10 represents prior art and consists of a block diagram of the functional elements within a distributed relational database 1000. In this embodiment of the prior art, an SQL interpreter and query processor 1001 is used to forward queries to an index database server 1002 which returns the row numbers for all matching rows in a table. The SQL query processor 1001 subsequently retrieves the columns for the matching tables from the database servers 1003-1006 that contain the individual columns of each table. In the embodiment shown, server 1002 contains all index records for primary and secondary indexes, server 1003 contains all rows for column “1” in table “A”, server 1004 contains all rows for column “2” in table “A”, server 1005 contains all rows for column “1” in table “B”, and server 1006 contains all rows for column “2” in table “B”. In another embodiment of the prior art, servers 1004-1006 may contain any combination of rows and index records for a given column in a relational database table, or any combination such that each server 1004-1006 contains the content of an entire table.

FIG. 11 represents prior art and consists of a diagram of the functional elements of an inverted index, as is understood by those proficient in the art. In the inverted index 1100, words are extracted from source uniquely identified documents 1101,1102 by parsers 1103,1104 which reduce the documents to a set of unique words 1105,1106 such that the sets of unique words 1105,1106 contain a single instance of any word in the source documents 1101,1102 regardless of the number of occurrences of that word in the original text. The unique word lists 1105,1106 are combined and extended into an inverted index 1107 such that for each word listed, the unique identifier for each document 1101,1102 in which the word occurs is associated with the word in the inverted index 1107. Thus, as will be understood by those proficient in the art, retrieving the entry for any word will cause a list of the documents in which the word occurs to be made available to the entity performing the query.

FIG. 12 is a flowchart illustrating another embodiment of the present invention which is representative of a variation of the embodiment described in FIG. 1. In the present embodiment, client application 1201 sends messages via message pathway 1210 to network 1206. Network 1206 forwards these messages via message pathway 1211 to a designated agent node 1202. By means of algorithmic processing of the received messages, agent node 1202 transmits single or multiple messages 1212 to network 1207 which then distributes these messages using message pathways 1213, 1214, 1215 to agent nodes 1203, 1204 and 1205. Subsequent to processing at agent nodes 1203, 1204 and 1205, response messages are sent by message pathways 1213, 1214 and 1215 to network 1207. Network 1207 sends these response messages to agent node 1202, which then processes the messages. Subsequent to processing, agent node 1202 transmits reply messages by message path 1211 to the network 1206, which transmits the same messages by message pathway 1210 to the client application 1201.

Further preferred embodiments of the present invention include methods directed to (a) Active Data Structures, (b) Mobile Devices, (c) Ad-Hoc Device Collections, and (d) Concurrent Massively Parallel Supercomputers.

In each of these embodiments related to Active Data Structures, Mobile Devices, Ad-Hoc Device Collections, and Concurrent Massively Parallel Supercomputers, the present invention includes preferred embodiments related to methods of assembling a catalog of objects and object references from objects stored within a network, wherein the network includes a plurality of interconnected computers with each computer storing a plurality of objects and a plurality of object catalogs. These methods comprise the steps of running a plurality of agent programs on each computer, the plurality of agent programs containing a plurality of programmable virtual machine environments, a plurality of standardized collections of executable functions suitable for communication with a respective one the computers, and a plurality of executable functions for managing objects and sending and receiving messages. Next, a plurality of messages is compiled, each message including source and destination meta data, meta data describing properties of the message, object data embedded within the message, and a plurality of object data payloads. At least one first message from at least one a computer is received, a program executed on a computer receiving the at least one first message, and a plurality of sensors that perform measurements, the at least one first message including source and destination meta data, meta data describing properties of the message, object data embedded within the message, and a plurality of object data payloads. At least one second message is transmitted to at least one of a computer and a program executed on a computer transmitting the at least one second message, the at least one second message including source and destination meta data, meta data describing properties of the message, object data embedded within the message, and a plurality of object data payloads; determining the disposition of at least one of the plurality of messages by executing code written for the virtual machine embedded within the agent program. A plurality of catalogs is created containing a plurality of references to a plurality of object data and a plurality of object properties, each catalog comprising a plurality of indices and a plurality of object storage areas.

In regard to methods particularly related to Active Data Structures, in creating trees, lists, queues, stacks and other data structures in a computer program, code determines where data is to be stored, even if that storage is not directly associated with the hardware the program is running on. Storage and data structures are passive, and must be manipulated by an omniscient program. In these embodiments, each agent forms a part of the overall data set, and will order incoming data (or requests for data) based on the relationship between a group of agents.

For example, in a b+tree, a node holds N records, where child nodes containing values within a range related to the record are attached to the record. In a normal system, all data movement is performed by a program that has access to the entire b+tree. Thus, the same set of agents used for the B+tree with the first key can also handle messages for a second B+tree active data structure which uses a completely different key arrangement. The practical application is that there can be two different sets of optimization for data based on retrieval or storage requirements without impacting elements such as the physical network structure.

In the methods of these embodiments, an agent would take the place of each record, and storage would be performed by sending the node a message. The appropriate agent then routes the data. This eliminates any need to know exactly where data is stored (the network of agents will figure that out), and it also means that the entire system can be balanced on the fly for performance. Data movement occurs in parallel, not as serial operations, thereby increasing performance by many orders of magnitude while also allowing for much larger storage. Thus, these agents act as gatekeepers and routers of event data based on one or more key values. And moreover, in such “active” data structures, the structures are themselves internally manipulating data rather than an outside program manipulating elements thereof.

Fundamentally, the technology and application of the agents of these inventive methods, when applied to the “big data” applications now popular in the industry, have substantial utility.

In a multi-way trie, as utilized in the methods of the present invention, each small block is a record with a key value and each collection of small blocks constitutes a node. To organize the trie upon insertion or removal of data, a program must process each node in turn, moving records as required to maintain the organization.

Using agents to represent nodes, messages are sent instead and the entire structure can be updated in parallel without a master program being aware of where things must be stored, or even the individual key values. This greatly improves performance and capacity while also allowing the entire structure to be tuned based on the most frequent, largest (or other measure) records.

In regard to methods specifically related to Active Data Structures, the agent computer program uses a plurality of algorithms to store event objects organized in a structure within a storage device such that the structure organization is determined by a plurality of algorithms which assess the relationship of the agent computer program with a plurality of other agent computer programs and the content of the event objects.

In regard to these methods specifically related to Active Data Structures, the agent computer program uses a plurality of algorithms to dispatch a plurality of event objects, or event object components, to a plurality of agent computer programs using a plurality of networks, based on the relationship of the agent computer program to an algorithmically defined plurality of agent computer programs, and also where the reply routing is algorithmically determined to satisfy a plurality of requirements.

In these embodiments, the plurality of agent computer programs and plurality of connecting networks may represent a tree structure containing a plurality of records, wherein each record or node of records within the tree is controlled and manipulated by a plurality of agent computer programs, or may represent a multiway-trie containing a plurality of records, wherein each record or node of records within the tree is controlled and manipulated by a plurality of agent computer programs.

In these preferred methods, the plurality of agent computer programs and plurality of connecting networks may represent a doubly-linked list, wherein each record or set of records within the list is controlled and manipulated by a plurality of agent computer programs, or wherein the plurality of agent computer programs and plurality of connecting networks represents a queue, wherein each record or set of records within the queue is controlled and manipulated by a plurality of agent computer programs.

In further such preferred embodiments, the plurality of agent computer programs and plurality of connecting networks may represent a stack, wherein each record or set of records within the queue is controlled and manipulated by a plurality of agent computer programs, or may represent a tree structure containing a plurality of records, wherein each record or node of records within the tree is controlled and manipulated by a plurality of agent computer programs, or may represent alternatively a multiway-trie containing a plurality of records, wherein each record or node of records within the tree is controlled and manipulated by a plurality of agent computer programs.

In yet further such preferred embodiments, the plurality of agent computer programs may also represent a doubly-linked list, wherein each record or set of records within the list is controlled and manipulated by a plurality of agent computer programs.

Yet further, the plurality of agent computer programs may represent a queue, or alternatively a stack, wherein each record or set of records within the queue is controlled and manipulated by a plurality of agent computer programs.

Such plurality of agent computer programs may individually manage a plurality of uniquely identified tree structures, or a plurality of uniquely identified multiway-trie structures, or a plurality of doubly-linked lists, or a plurality of queues, or stacks, or uniquely identified tree structures, or uniquely identified multiway-trie structures.

Yet additionally, the plurality of agent computer programs may in such preferred embodiments individually manage a plurality of agent programs that manage uniquely identified doubly-linked lists or queues, or identified stacks.

In regard to embodiments of methods directed to Mobile Devices, these are intended to address ad-hoc collections of portable devices that are in communication with each other—based on location, time or both. One example would be cell phones in a location where users might be looking for others.

These embodiments include, inter alia, the use of RFID tags that contain a small CPU that operates for a few seconds based on a capacitive charge generated by an RF field and an inductor/antenna circuit. These are sometimes known as “active” RFID tags.

Other preferred embodiments include collections of active RFID tags where all of the tags exposed to a signal are active, and can thus communicate with each other while active. For example, a group of objects (such as for example a pile of expensive rugs) could be tagged, and all tags activated within that group with a scanner. The tagged objects could then self-bundle by communicating with each other as a group. Subsequent activation after movement would allow the collection to determine whether members had been added or removed.

In regard to embodiments of methods directed to Mobile Devices the agent computer program determines messages to be processed based on the location of the agent on a portable computing device.

In regard to embodiments of methods directed to Mobile Devices, the agent computer program determines messages to be processed based on the location of the agent on a portable computing device which is a member of a plurality of mobile devices in which the incidence of plurality is determined by a separate data source, or by a separate entity, or by environmental factors or data not contained within messages.

In regard to embodiments of methods directed to Mobile Devices, the agent computer program may also determine messages to be processed based on the location of the agent on a passive computing device, or based on the location of the agent on a passive computing device that is in turn a member of a plurality of passive computing devices.

Method embodiments of Ad-Hoc Device Collections may relate to time, location or message content. In these method embodiments of Ad-Hoc Device Collections, the agent computer program determines membership within a plurality of agents based on messages processed where the incidence of plurality is determined by a time period or by a plurality of time periods, or by a physical location, or by a plurality of physical locations. a virtual or logical location, or by a plurality of virtual or plurality of logical locations, or by a plurality of characteristics detected in or extracted from messages received, or by a plurality of characteristics detected in or extracted from environmental inputs.

In these method embodiments of Ad-Hoc Device Collections, the agent computer program may determine membership within a plurality of agents that are further contained within a plurality of agents based on messages processed, and also may determine messages to be processed based on the characteristics of the membership within the plurality of agents.

Method embodiments related to Concurrent Massively Parallel Supercomputers address “big data” operations where collections of agents are organized into groups or hierarchies of groups, where group configuration may change according to a message received from an external source or generated within one or more groups. Essentially, these embodiments include methods wherein a self-organizing collection of agents acts on a set of rules in order to find the most efficient method for processing data or algorithms.

In such method embodiments related to Concurrent Massively Parallel Supercomputers, the agent computer program determines the messages to be processed based on membership in a plurality of agents that are contained within the logical boundaries of a multiple-device platform.

In other such embodiments, the agent computer program determines the messages to be processed based on membership in a plurality of agents that are contained within the logical boundaries of a multiple-device platform and where the logical boundaries are further divided into logical partitions. Additionally, in such preferred embodiments, the agent computer program may determine the messages to be processed based on membership in a plurality of agents that are contained within the logical boundaries of a multiple-device platform and where the logical boundaries are further divided into logical partitions over a plurality of time periods based on the content of messages processed.

The PointofData Active Information Platform (AIP) combines a hybrid data storage model with distributed processing to create a comprehensive information storage and retrieval system which may be expanded in a structured or unstructured way. Because of its organization and method of representing data, the AIP provides an efficient platform for storing, retrieving and analyzing large amounts of data even with minimal computing resources.

All data stored in the AIP is composed of events, which are automatically related to each other by time and location. An event is a piece of information that comes into existence at a specific time and at a specific location and is therefore unique. Since time and location are universally available environmental values, event objects may be distributed across dozens, hundreds or thousands of individual databases without a central coordinating authority. Events may have data associated with them (an individual event may contain a simple value or terabytes of data), they may be linked to each other using various contexts, and they may have searchable tags attached. Events are stored in a distributed system of nodes, where each node is independent of others, but nodes may be aware of each other and can decide locally how to handle events and their associated data or links using a built-in messaging platform. Messages can be filtered, duplicated, forwarded or modified according to rules at each node in the system. This structure allows the AIP to do things that are otherwise extremely difficult to achieving using traditional database architectures and distributed processing systems. For example, expanding the storage capacity of an AIP system involves adding nodes and connecting them to existing nodes, then altering the existing rules to allow new event objects to be stored. Since events and messages may be routed or managed using rules applied to the event objects or attached data, very complex and yet very high-speed intelligent data storage and retrieval systems can be built, and optimization for specific tasks can be performed by altering rules instead of rebuilding entire data collections. Using the message processing and routing facilities, an AIP node collection can be configured such that data is routed based on storage efficiency, retrieval time constraints or frequency of use. Based on message routing, an AIP node collection can even provide multiple data storage and retrieval optimizations simultaneously.

In very large data collections stored using traditional database methods, significant computing resources are required to traverse tables or other data collections to generate results. In addition, the structure of the data must be well known in order to formulate queries efficiently. In the AIP, queries are more in the nature of a pattern matching activity, and the data storage system is designed to efficiently detect what stored event objects match a pattern or a set of patterns. Since nodes in the AIP can be designed to accept only event objects which match certain patterns, a query for event objects does not necessarily need to examine all nodes, leading to better performance and reduced resource usage. In certain applications, some data may be more frequently or more heavily used, and the AIP nodes can be configured in such a way that resources are efficiently assigned to those nodes that require more capacity than others. This is especially useful for systems which are cloud-based and run on virtual machines, where computing capacity or data throughput may be charged at different rates depending on the virtual machine configuration. A node which services infrequently used data might be placed on a low-resource virtual machine which has a low cost. However, if that data assumes greater importance, the virtual machine configuration can be upgraded without requiring any action related to the AIP node located on it.

The event objects stored within the AIP may have tags associated with them, which like links can be segregated by context. One of the great difficulties with search engines is that some search words have multiple meanings, but that meaning is lost without context. In the AIP, tags act much like search words, but their meaning can be retained by placing them within contexts, avoiding large numbers of false positive results, and reducing the resources required to perform a query. Because event objects are unique, it is also not necessary for the AIP to store tag data associated with an event object in the same location as the event object itself. This permits very efficient query processing, because not only can event object data be distributed, but specific kinds of queries can be distributed as well, using resources best suited for the type of query.

Since events and their associated data may be linked in arbitrary ways, the AIP can be made to behave like many structured data storage systems, such as SQL servers. In the AIP, a row in a table might be represented by a single event object, where other event objects linked via a specific context then represent columns in that row. Changes to data—in effect, new versions—can then be linked to the event objects representing columns. Not only may data then be retrieved by value, but also by time period (snapshots). The point is that the AIP allows for the imposition of structure, but does not require it. This permits the AIP to accept new data associated with existing event objects without requiring schema changes, index rebuilds, table relocations or other costly operations which are common to many large database systems as well as many “big data” environments. This also permits the AIP to make very efficient use of data storage, requiring space only for those event objects created and their links.

Last, the AIP can provide a level of data security not matched in traditional database architectures. Because all data is retrieved using a message routing backbone, the AIP nodes can determine not only if a specific user or application has access to data, but also if that access is valid based on where or when a query originated, and if the query might also retrieve data that when analyzed as a whole might compromise security. The opposite is true as well; using the AIP, data may be retrievable only if the proper parts of the query exist and parts of the overall data are retrieved from specific nodes in a specific order. The AIP can also report whether a query would retrieve data or not, but without revealing where that data might be stored, and what is contained within the data.

To conclude, the AIP is more than a simple database engine or a message routing platform. It is a highly configurable information storage and retrieval platform which can evolve organically to support the needs of an organization, while retaining the ability to reconstruct the data stored as it appeared at any point in time as well as where the data originated.

In addition, a wide variety of combinations and permutations of supplemental inventive embodiments comprise yet further aspects of the present invention, and for example:

In supplemental embodiment A, methods are included wherein the agent computer program uses a plurality of algorithms to store event objects organized in a structure within a storage device such that the structure organization is determined by a plurality of algorithms which assess the relationship of the agent computer program with a plurality of other agent computer programs and the content of the event objects.

In supplemental embodiment B, methods are included wherein the agent computer program uses a plurality of algorithms to dispatch a plurality of event objects to a plurality of agent computer programs using a plurality of networks, based on the relationship of the agent computer program to an algorithmically defined plurality of agent computer programs.

In supplemental embodiment C, methods are included wherein the agent computer program uses a plurality of algorithms to dispatch a plurality of requests for event object components to a plurality of agent computer programs using a plurality of networks, based on the relationship of the agent computer program to an algorithmically defined plurality of agent computer programs.

In supplemental embodiment D, methods are included wherein the agent computer program uses a plurality of algorithms to dispatch a plurality of request replies for event object components to a plurality of agent computer programs using a plurality of networks, based on the relationship of the agent computer program to an algorithmically defined plurality of agent computer programs where the reply routing is algorithmically determined to satisfy a plurality of requirements.

Yet further, and for each of supplemental embodiments A, B, D, and D, met further inventive methods are included, as follows:

-   -   1. wherein the storage, retrieval, generation or request of         event objects causes agent computer programs to execute computer         programs that process data accessible to a plurality of agent         programs, and to transmit the results of those computer programs         to a plurality of agent programs;     -   2. wherein the plurality of agent computer programs and         plurality of connecting networks represents a tree structure         containing a plurality of records, wherein each record or node         of records within the tree is controlled and manipulated by a         plurality of agent computer programs, and wherein the results of         the computer programs referenced are transmitted to a plurality         of agent programs;     -   3. wherein the plurality of agent computer programs and         plurality of connecting networks represents a multiway-trie         containing a plurality of records, wherein each record or node         of records within the tree is controlled and manipulated by a         plurality of agent computer programs, and wherein the results of         the computer programs referenced are transmitted to a plurality         of agent programs;     -   4. wherein the plurality of agent computer programs and         plurality of connecting networks represents a doubly-linked         list, wherein each record or set of records within the list is         controlled and manipulated by a plurality of agent computer         programs, and wherein the results of the computer programs         referenced are transmitted to a plurality of agent programs;     -   5. wherein the plurality of agent computer programs and         plurality of connecting networks represents a queue, wherein         each record or set of records within the queue is controlled and         manipulated by a plurality of agent computer programs, and         wherein the results of the computer programs referenced are         transmitted to a plurality of agent programs;     -   6. wherein the plurality of agent computer programs represents a         tree structure containing a plurality of records, wherein each         record or node of records within the tree is controlled and         manipulated by a plurality of agent computer programs, and         wherein the results of the computer programs referenced are         transmitted to a plurality of agent programs;     -   7. wherein the plurality of agent computer programs represents a         doubly-linked list, wherein each record or set of records within         the list is controlled and manipulated by a plurality of agent         computer programs, and wherein the results of the computer         programs referenced are transmitted to a plurality of agent         programs; and     -   8. wherein the plurality of agent computer programs represents a         stack, wherein each record or set of records within the queue is         controlled and manipulated by a plurality of agent computer         programs, and wherein the results of the computer programs         referenced are transmitted to a plurality of agent programs.

While certain preferred and alternative embodiments of the invention have been described, such description is for illustrative purposes only, and it is to be understood that changes and variations may be made without departing from the spirit or scope of the following claims. 

What is claimed is:
 1. A method of assembling a catalog of objects and object references from objects stored within a network, the network including a plurality of interconnected computers with each computer storing a plurality of objects and a plurality of object catalogs, the method comprising: executing a plurality of agent programs on each computer, the plurality of agent programs containing a plurality of virtual machine environments, a plurality of collections of machine interpreted functions of which a plurality are suitable for communication with a respective plurality of the computers, a plurality of collections of machine interpreted functions of which a plurality are suitable for communication with a respective plurality of the agents on a plurality computers, and a plurality of machine interpreted functions for managing objects and sending and receiving messages; compiling a plurality of messages, each message including source and destination meta data, meta data describing properties of the message, object data embedded within the message, and a plurality of object data payloads; receiving at least one first message from at least one a computer, a program executed on a computer receiving the at least one first message, the at least one first message including source and destination meta data, meta data describing properties of the message, object data embedded within the message, and a plurality of object data payloads; transmitting at least one second message to at least one of a computer and a program executed on a computer transmitting the at least one second message, the at least one second message including source and destination meta data, meta data describing properties of the message, object data embedded within the message, and a plurality of object data payloads; determining the disposition of at least one of the plurality of messages; and creating a plurality of catalogs containing a plurality of references to a plurality of object data and a plurality of object properties, each catalog comprising a plurality of indices and a plurality of object storage areas; and further wherein the agent computer program uses a plurality of algorithms to store event objects organized in a structure within a storage device such that the structure organization is determined by a plurality of algorithms which assess the relationship of the agent computer program with a plurality of other agent computer programs and the content of the event objects.
 2. A method of assembling a catalog of objects and object references from objects stored within a network, the network including a plurality of interconnected computers with each computer storing a plurality of objects and a plurality of object catalogs, the method comprising: executing a plurality of agent programs on each computer, the plurality of agent programs containing a plurality of virtual machine environments, a plurality of collections of machine interpreted functions of which a plurality are suitable for communication with a respective plurality of the computers, a plurality of collections of machine interpreted functions of which a plurality are suitable for communication with a respective plurality of the agents on a plurality computers, and a plurality of machine interpreted functions for managing objects and sending and receiving messages; compiling a plurality of messages, each message including source and destination meta data, meta data describing properties of the message, object data embedded within the message, and a plurality of object data payloads; receiving at least one first message from at least one a computer, a program executed on a computer receiving the at least one first message, the at least one first message including source and destination meta data, meta data describing properties of the message, object data embedded within the message, and a plurality of object data payloads; transmitting at least one second message to at least one of a computer and a program executed on a computer transmitting the at least one second message, the at least one second message including source and destination meta data, meta data describing properties of the message, object data embedded within the message, and a plurality of object data payloads; determining the disposition of at least one of the plurality of messages; and creating a plurality of catalogs containing a plurality of references to a plurality of object data and a plurality of object properties, each catalog comprising a plurality of indices and a plurality of object storage areas; and further wherein the agent computer program uses a plurality of algorithms to dispatch a plurality of event objects to a plurality of agent computer programs using a plurality of networks, based on the relationship of the agent computer program to an algorithmically defined plurality of agent computer programs.
 3. A method of assembling a catalog of objects and object references from objects stored within a network, the network including a plurality of interconnected computers with each computer storing a plurality of objects and a plurality of object catalogs, the method comprising: executing a plurality of agent programs on each computer, the plurality of agent programs containing a plurality of virtual machine environments, a plurality of collections of machine interpreted functions of which a plurality are suitable for communication with a respective plurality of the computers, a plurality of collections of machine interpreted functions of which a plurality are suitable for communication with a respective plurality of the agents on a plurality computers, and a plurality of machine interpreted functions for managing objects and sending and receiving messages; compiling a plurality of messages, each message including source and destination meta data, meta data describing properties of the message, object data embedded within the message, and a plurality of object data payloads; receiving at least one first message from at least one a computer, a program executed on a computer receiving the at least one first message, the at least one first message including source and destination meta data, meta data describing properties of the message, object data embedded within the message, and a plurality of object data payloads; transmitting at least one second message to at least one of a computer and a program executed on a computer transmitting the at least one second message, the at least one second message including source and destination meta data, meta data describing properties of the message, object data embedded within the message, and a plurality of object data payloads; determining the disposition of at least one of the plurality of messages; and creating a plurality of catalogs containing a plurality of references to a plurality of object data and a plurality of object properties, each catalog comprising a plurality of indices and a plurality of object storage areas; and further wherein the agent computer program uses a plurality of algorithms to dispatch a plurality of requests for event object components to a plurality of agent computer programs using a plurality of networks, based on the relationship of the agent computer program to an algorithmically defined plurality of agent computer programs.
 4. A method of assembling a catalog of objects and object references from objects stored within a network, the network including a plurality of interconnected computers with each computer storing a plurality of objects and a plurality of object catalogs, the method comprising: executing a plurality of agent programs on each computer, the plurality of agent programs containing a plurality of virtual machine environments, a plurality of collections of machine interpreted functions of which a plurality are suitable for communication with a respective plurality of the computers, a plurality of collections of machine interpreted functions of which a plurality are suitable for communication with a respective plurality of the agents on a plurality computers, and a plurality of machine interpreted functions for managing objects and sending and receiving messages; compiling a plurality of messages, each message including source and destination meta data, meta data describing properties of the message, object data embedded within the message, and a plurality of object data payloads; receiving at least one first message from at least one a computer, a program executed on a computer receiving the at least one first message, the at least one first message including source and destination meta data, meta data describing properties of the message, object data embedded within the message, and a plurality of object data payloads; transmitting at least one second message to at least one of a computer and a program executed on a computer transmitting the at least one second message, the at least one second message including source and destination meta data, meta data describing properties of the message, object data embedded within the message, and a plurality of object data payloads; determining the disposition of at least one of the plurality of messages; and creating a plurality of catalogs containing a plurality of references to a plurality of object data and a plurality of object properties, each catalog comprising a plurality of indices and a plurality of object storage areas; and further wherein the agent computer program uses a plurality of algorithms to dispatch a plurality of request replies for event object components to a plurality of agent computer programs using a plurality of networks, based on the relationship of the agent computer program to an algorithmically defined plurality of agent computer programs where the reply routing is algorithmically determined to satisfy a plurality of requirements.
 5. The method of any of claims 1, 2, 3 or 4 wherein the storage, retrieval, generation or request of event objects causes agent computer programs to execute computer programs that process data accessible to a plurality of agent programs, and to transmit the results of those computer programs to a plurality of agent programs.
 6. The method of any of claims 1, 2, 3 or 4 wherein the plurality of agent computer programs represents a stack, wherein each record or set of records within the queue is controlled and manipulated by a plurality of agent computer programs, and wherein the results of the computer programs referenced are transmitted to a plurality of agent programs.
 7. The method of any of claims 1, 2, 3 or 4 wherein the plurality of agent computer programs and plurality of connecting networks represents a multiway-trie containing a plurality of records, wherein each record or node of records within the tree is controlled and manipulated by a plurality of agent computer programs, and wherein the results of the computer programs referenced are transmitted to a plurality of agent programs.
 8. The method of any of claims 1, 2, 3 or 4 wherein the plurality of agent computer programs and plurality of connecting networks represents a doubly-linked list, wherein each record or set of records within the list is controlled and manipulated by a plurality of agent computer programs, and wherein the results of the computer programs referenced are transmitted to a plurality of agent programs.
 9. The method of any of claims 1, 2, 3 or 4 wherein the plurality of agent computer programs and plurality of connecting networks represents a queue, wherein each record or set of records within the queue is controlled and manipulated by a plurality of agent computer programs, and wherein the results of the computer programs referenced are transmitted to a plurality of agent programs.
 10. The method of any of claims 1, 2, 3 or 4 wherein the plurality of agent computer programs represents a tree structure containing a plurality of records, wherein each record or node of records within the tree is controlled and manipulated by a plurality of agent computer programs, and wherein the results of the computer programs referenced are transmitted to a plurality of agent programs.
 11. The method of any of claims 1, 2, 3 or 4 wherein the plurality of agent computer programs represents a doubly-linked list, wherein each record or set of records within the list is controlled and manipulated by a plurality of agent computer programs, and wherein the results of the computer programs referenced are transmitted to a plurality of agent programs.
 12. The method of any of claims 1, 2, 3 or 4 wherein the plurality of agent computer programs and plurality of connecting networks represents a tree structure containing a plurality of records, wherein each record or node of records within the tree is controlled and manipulated by a plurality of agent computer programs, and wherein the results of the computer programs referenced are transmitted to a plurality of agent programs. 